Splitting Lemma for Biholomorphic Mappings with Smooth Dependence on Parameters
نویسندگان
چکیده
منابع مشابه
A splitting lemma
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise non-adjacent vertices) of the graph. Our analysis shows that the stability number of every graph G can be decomposed in the sum of the stability number of a...
متن کاملFatou’s Lemma for Unbounded Gelfand Integrable Mappings
It is shown that, in the framework of Gelfand integrable mappings, the Fatou-type lemma for integrably bounded mappings, due to Cornet–Medecin [14] and the Fatou-type lemma for uniformly integrable mappings due to Balder [9], can be generalized to mean norm bounded integrable mappings.
متن کاملA splitting lemma for equivariant dynamics
Giuseppe Gaeta Centre de Physique Theorique, Ecole Polytechnique F-91128 Palaiseau (France) and Departamento de Fisica Teorica II, Universidad Complutense E-28040 Madrid (Spain) Summary. It is shown that a number of interesting and useful results in equivariant dynamics can be seen as a consequence of a general "splitting principle". Both the results and the principle are actually embodied by t...
متن کاملKernel Convergence and Biholomorphic Mappings in Several Complex Variables
We deal with kernel convergence of domains in Cn which are biholomorphically equivalent to the unit ball B. We also prove that there is an equivalence between the convergence on compact sets of biholomorphic mappings on B, which satisfy a growth theorem, and the kernel convergence. Moreover, we obtain certain consequences of this equivalence in the study of Loewner chains and of starlike and co...
متن کاملThe Lovasz Splitting-off Lemma
Theorem 1 Let G = (V ∪ {s}, E) be a graph such that ∀ ∅ = U V : d(U) ≥ k, (1) ̄ where d(U) denotes the number of edges between U and U , and k ≥ 2. Also, assume that d(s) (the degree of the vertex s) is even. Then for every (s, t) ∈ E, there exists (s, u) ∈ E such that the graph G′ = (V ∪ s, E \ {(s, t), (s, u)} ∪ {(t, u)}) also satisfies the condition (1). Proof: Let S denote the set of neighbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Geometric Analysis
سال: 2020
ISSN: 1050-6926,1559-002X
DOI: 10.1007/s12220-020-00504-0